home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Dr. Windows 3
/
dr win3.zip
/
dr win3
/
DATABASE
/
WINREFER.ZIP
/
TEST_REF.REF
< prev
next >
Wrap
Text File
|
1992-12-02
|
18KB
|
646 lines
%T Applying New Scheduling Theory to Static Priority Pre-emptive Scheduling
%A N. Audsley
%A A. Burns
%A M. Richardson
%A K. Tindell
%A A. Wellings
%R RTRG/92/120
%J Report RTRG/92/120 Department of Computer Science, University of York
%D February 1992
%T Mode Changes in Priority Pre-emptively Scheduled Systems
%A K. W. Tindell
%A A. Burns
%A A. J. Wellings
%J Proceedings 13th IEEE Real-Time Systems Symposium
%C Phoenix, Arizona, USA
%D 2-4 December 1992
%T Using Offset Information to Analyse Static Priority Pre-Emptively Scheduled Task Sets
%A K. Tindell
%I Dept of Computer Science, University of York
%R YCS 182
%D August 1992
%T Allocating Real-Time Tasks (An NP-Hard Problem made Easy)
%A K. Tindell
%A A. Burns
%A A.J. Wellings
%J Real-Time Systems
%V 4
%N 2
%D June 1992
%P 145-165
%T Optimal Priority Assignment and Feasibility of Static Priority Tasks With Arbitrary Start Times
%A N. C. Audsley
%I Dept. Computer Science, University of York
%R YCS 164
%D December 1991
%T Fixed Priority Scheduling of Periodic Task Sets With Arbitrary Deadlines
%A J. P. Lehoczky
%J Proceedings 11th IEEE Real-Time Systems Symposium
%C Lake Buena Vista, FL, USA
%D 5-7 Decmeber 1990
%P 201-209
%K RTSS rate-monotonic periodic scheduling uniprocessor
%T STRESS: A Simulator For Hard Real-Time System
%A N. C. Audsley
%A A. Burns
%A M. F. Richardson
%A A. J. Wellings
%R RTRG/91/106
%I Real-Time Research Group, Department of Computer Science, University of
York
%D October 1991
%K stress manual standard
%T Experiments with a program timing tool based on source-level timing schema
%X Analytic methods are employed at the source-language level, using formal
timing schema that include control costs, handle interferences such as
interrupts, and produce guaranteed best- and worst-case bounds. The timing tool
computes the deterministic execution times for programs that are written in a
subset of C and run on a bare machine. Two versions of the tool were written,
using two granularity extremes for the atomic elements of the timing schema.
All overview of the tool is given, timing schema and code prediction are
discussed, and machine analysis and timing tool design are examined.
Experimental and validation results are reported. It was found that all the
predicted times are consistent, and most are safe. Some predictions are fairly
tight, while others are a little loose. There are clear technical reasons that
explain the differences between measured and predicted times, and technical
solutions that should minimize these differences within the timing schema
framework are seen
%K program timing tool, source-level timing schema, formal timing schema, Sep91 execution times
%O Computer (USA)
%J Computer
%A C.Y. Park
%A A.C. Shaw
%V 24
%N 5
%P 48-57
%D May 1991
%T Building a Predictable Avionics Platform in Ada: A Case Study
%A C. D. Locke
%A D. R. Vogel
%A T. J. Mesler
%P 181-
%D December 1991
%I Proceedings of the 12th Real Time Systems Symposium
%T Finding Response Times in a Real-Time System
%A M. Joseph
%A P. Pandya
%J BCS Computer Journal
%D Vol. 29, No. 5, Oct 86
%P 390-395
%X Some alternative analysis of static priority scheduling, though it does
not explicitly mention the rate monotonic algorithm. Extends it to
allow for buffered inputs.
%T Parallel Simulated Annealing using Speculative Computation
%A E. E. Witte
%A R. D. Chamberlain
%A M. A. Franlin
%J IEEE Transactions on Parallel and Distributed Systems
%V 2
%N 4
%D October 1991
%P 483-494
%T Grundlagen der Strassenverkehrsplanung in Stadt und Land
%A J. W. Korte
%D 1960
%I Wiesbaden Bauverlag GmbH
%T Resource Control For Hard Real-Time Systems: A Review
%A N. C. Audsley
%R YCS 159
%I Department of Coputer Science, University of York
%D August 1991
%T Programming highly parallel general-purpose applications
%A S.A. Dobson
%A A.J. Wellings
%B Proceedings of the BCS workshop on abstract machine models for highly parallel computers
%I University of Leeds
%P 40-52
%V 2
%D 24-26th March 1991
%T On The Feasibility of Response Time Predictions - An Experimental Evaluation
%A A. Vrchoticky
%A P. Puschner
%I PDCS Project (Esprit BRA Project 3092), Second Year Report
%V 2
%D May 1991
%K mars dma problem
%T Real-time System Design
%A S. Levi
%A A. Agrawala
%B McGraw Hill
%D 1990
%K formal book
%T Four-Slot Fully Asynchronous Communication Mechanism
%A H. Simpson
%J IEE Proceedings
%D Vol. 137, Pt. E., No. 1, Jan 1990
%P 17-30
%R Vol 3/Communication
%T Dynamic code replacement and Ada
%X There is a problem in trying to maintain highly reliable software which must
continue executing over a long period of time. This problem is characterized by
the international space station Freedom. The space station has a long planned
lifetime and requires that the computer system remain running for this period.
Updates to software normally require reloading. This paper reports on a study
into eliminating the need for reloading by providing mechanisms whereby Ada
programs can be changed in a consistent manner, permitting the execution of
the system to continue
%K highly reliable software, space station Freedom, Ada programs Jan91
%O Ada Lett. (USA)
%J Ada Letters
%A K. Tindell
%V 10
%N 7
%P 47-54
%D Sept.-Oct. 1990
%T Reconfigurable Flight Control Via Multiple Model Adaptive Control Methods
%A P. S. Maybeck
%A R. D. Stevens
%J IEEE Transactions on Aerospace and Electronic Systems
%D May 1991
%V 27
%N 3
%P 470-480
%T Effect of Errors on a Contention-Based TDMA Protocol
%A L-S. Liang
%A J-F. Chang
%J IEEE Transactions on Aerospace and Electronic Systems
%D May 1991
%V 27
%N 3
%P 492-506
%T Channel Characteristics in Local-Area Hard Real-Time Systems
%A K. Ramamritham
%J Computer Networks and ISDN Systems
%V 13
%N 1
%D 1987
%T Mode Change Protocols for Priority-Driven Premptive Scheduling
%A L. Sha
%A R. Rajkumar
%A J. Lehoczky
%A K. Ramamritham
%J Real-Time Systems
%V 1
%N 3
%D 1989
%P 244-264
%K RTS
%T A Possible Architecture of a Distributed Hard Real-Time Executive for Space Applications
%A S. Sabina
%A F. Fedi
%J First International Symposium on Ground Data Systems for Spacecraft Control, ESOC, Darmstadt, Germany
%D 26-29 June 1990
%T On a Real-Time Scheduling Problem
%A S. K. Dhall
%A C. L. Liu
%J Operations Research
%V 26
%N 1
%P 127-140
%D February 1978
%T Optimization by Simulated Annealing: An experimental Evaluation; Part I, Graph Partitioning
%A David S. Johnson
%A Cecilia R. Aragon
%A Lyle A. McGeoch
%A Catherine Schevon
%J Operations Research
%V 37
%N 6
%P 865-892
%D November-December 1989
%T Digital Control Using Microprocessors
%A Paul Katz
%I Prentice Hall International
%D 1981
%T Heuristic Technique for Processor and Link Assignment in Multicomputers
%A S. Wayne Bollinger
%A Scott F. Midkiff
%J IEEE Transactions on Computers
%V 40
%N
%D March 1991
%P 325-333
%T Scheduling Hard Real-Time Systems: A Review
%A A. Burns
%J Software Engineering Journal
%V 6
%N 3
%P 116-128
%D 1991
%T A system for building scalable parallel applications
%A S.A. Dobson
%A A.J. Wellings
%B Proceedings of the IFIP working conference on programming environments for parallel computing
%I University of Edinburgh
%D 6-8th April 1992
%O To be published by Elsevier
%T A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System
%A S. H. Bokhari
%J IEEE Transactions on Software Engineering
%V SE-7
%N 6
%P 583-589
%D November 1981
%K TSE
IEEEtse
%T Heuristic Models of Task Assignment Scheduling in Distributed Systems
%A Kemal Efe
%J IEEE Computer
%V 15
%N 6
%D June 1982
%P 50-??
%K IEEEComp
%T A Heuristic Model for Task Allocation in Distributed Computer Systems
%A Anil K. Sarje
%A G. Sagar
%J IEEE Proceedings E - Computers and Digital Techniques
%D To Appear
%T A Problem Independent Parallel Implementation of Simulated Annealing: Models and Experiments
%A Pierre Roussel-Ragot
%A Gerard Dreyfus